Block Diagonal Preconditioners for the Schur Complement Method Block Diagonal Preconditioners for the Schur Complement Method

نویسندگان

  • Luiz M. Carvalho
  • Luc Giraud
چکیده

We present numerical methods for solving systems of linear equations originated from the discretisation of two-dimensional elliptic partial diierential equations. We are interested in diierential equations that describe heterogeneous and anisotropic phenomena. We use a nonoverlapping domain decomposition method for solving the linear systems. We describe new local preconditioners for the interface problems that have a numerical behaviour better than the block Jacobi preconditioner and almost the same computational complexity. We show a set of experiments for comparing the numerical performance of the local preconditioners.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Block Diagonal and Schur Complement Preconditioners for Block-Toeplitz Systems with Small Size Blocks

Abstract. In this paper we consider the solution of Hermitian positive definite block-Toeplitz systems with small size blocks. We propose and study block diagonal and Schur complement preconditioners for such block-Toeplitz matrices. We show that for some block-Toeplitz matrices, the spectra of the preconditioned matrices are uniformly bounded except for a fixed number of outliers and this fixe...

متن کامل

Preconditioners for Saddle Point Problems on Truncated Domains in Phase Separation Modelling

The discretization of Cahn-Hilliard equation with obstacle potential leads to a block 2ˆ2 non-linear system, where the p1, 1q block has a non-linear and non-smooth term. Recently a globally convergent Newton Schur method was proposed for the non-linear Schur complement corresponding to this non-linear system. The solver may be seen as an inexact Uzawa method which has the falvour of an active s...

متن کامل

Block Triangular Preconditioners for -matrices and Markov Chains

BLOCK TRIANGULAR PRECONDITIONERS FOR -MATRICES AND MARKOV CHAINS MICHELE BENZI AND BORA UÇAR Abstract. We consider preconditioned Krylov subspace methods for solving large sparse linear systems under the assumption that the coefficient matrix is a (possibly singular) -matrix. The matrices are partitioned into block form using graph partitioning. Approximations to the Schur complement are used t...

متن کامل

Probing Methods for Saddle-point Problems

Abstract. Several Schur complement-based preconditioners have been proposed for solving (generalized) saddle-point problems. We consider matrices where the Schur complement has rapid decay over some graph known a priori. This occurs for many matrices arising from the discretization of systems of partial differential equations, and this graph is then related to the mesh. We propose the use of pr...

متن کامل

Block Triangular Preconditioners for M-matrices and Markov Chains

We consider preconditioned Krylov subspace methods for solving large sparse linear systems under the assumption that the coefficient matrix is a (possibly singular) M -matrix. The matrices are partitioned into 2×2 block form using graph partitioning. Approximations to the Schur complement are used to produce various preconditioners of block triangular and block diagonal type. A few properties o...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1997